package com.sxkiler.demo.medium;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
matrix-block-sum=矩阵区域和
<p>给你一个&nbsp;<code>m * n</code>&nbsp;的矩阵&nbsp;<code>mat</code>&nbsp;和一个整数&nbsp;<code>K</code> ，请你返回一个矩阵&nbsp;<code>answer</code>&nbsp;，其中每个&nbsp;<code>answer[i][j]</code>&nbsp;是所有满足下述条件的元素&nbsp;<code>mat[r][c]</code> 的和：&nbsp;</p>

<ul>
	<li><code>i - K &lt;= r &lt;= i + K, j - K &lt;= c &lt;= j + K</code>&nbsp;</li>
	<li><code>(r, c)</code>&nbsp;在矩阵内。</li>
</ul>

<p>&nbsp;</p>

<p><strong>示例 1：</strong></p>

<pre><strong>输入：</strong>mat = [[1,2,3],[4,5,6],[7,8,9]], K = 1
<strong>输出：</strong>[[12,21,16],[27,45,33],[24,39,28]]
</pre>

<p><strong>示例 2：</strong></p>

<pre><strong>输入：</strong>mat = [[1,2,3],[4,5,6],[7,8,9]], K = 2
<strong>输出：</strong>[[45,45,45],[45,45,45],[45,45,45]]
</pre>

<p>&nbsp;</p>

<p><strong>提示：</strong></p>

<ul>
	<li><code>m ==&nbsp;mat.length</code></li>
	<li><code>n ==&nbsp;mat[i].length</code></li>
	<li><code>1 &lt;= m, n, K &lt;= 100</code></li>
	<li><code>1 &lt;= mat[i][j] &lt;= 100</code></li>
</ul>

 */
public class matrixBlockSum {
    

    class Solution {
        public Integer[][] matrixBlockSum(Integer[][] param0,Integer param1) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        [[1,2,3],[4,5,6],[7,8,9]]
1
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

